Certain rank 2K updates act like rank K

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the rank of certain parametrized elliptic curves

In this paper the family of elliptic curves over Q given by the equation Ep :Y2 = (X - p)3 + X3 + (X + p)3 where p is a prime number, is studied. Itis shown that the maximal rank of the elliptic curves is at most 3 and someconditions under which we have rank(Ep(Q)) = 0 or rank(Ep(Q)) = 1 orrank(Ep(Q))≥2 are given.

متن کامل

Low-rank updates of matrix functions

Abstract. We consider the task of updating a matrix function f(A) when the matrix A ∈ Cn×n is subject to a low-rank modification. In other words, we aim at approximating f(A+D)− f(A) for a matrix D of rank k n. The approach proposed in this paper attains efficiency by projecting onto tensorized Krylov subspaces produced by matrix-vector multiplications with A and A∗. We prove the approximations...

متن کامل

Rational Matrix Functions and Rank-1 Updates

Suppose f = p/q is a quotient of two polynomials and that p has degree rp and q has degree rq . Assume that f(A) and f(A+ uv ) are defined where A ∈ R, u ∈ R, and v ∈ R are given and set r = max{rp, rq}. We show how to compute f(A+uv ) in O(rn2) flops assuming that f(A) is available together with an appropriate factorization of the “denominator matrix” q(A). The central result can be interprete...

متن کامل

Low Rank Updates for the Cholesky Decomposition

Usage of the Sherman-Morrison-Woodbury formula to update linear systems after low rank modifications of the system matrix is widespread in machine learning. However, it is well known that this formula can lead to serious instabilities in the presence of roundoff error. If the system matrix is symmetric positive definite, it is almost always possible to use a representation based on the Cholesky...

متن کامل

Incremental Rank Updates for Moving Query Points

The query for retrieving the rank of all neighbors of a moving object at any given time, a continuous rank query, is an important case of continuous nearest neighbor (CNN) queries. An application for ranking queries is given by an ambulance driver who needs to keep track of the closest hospitals at all times. We present a set of incremental algorithms that facilitate efficient rank updates for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1992

ISSN: 0024-3795

DOI: 10.1016/0024-3795(92)90325-5